Z Shifts of Finite Type without Equal Entropy Full Shift Factors

نویسندگان

  • MIKE BOYLE
  • MICHAEL SCHRAUDNER
چکیده

For d ≥ 2, we use results of Hochman and Meyerovitch to construct examples of Zd shifts of finite type of entropy logN , N ∈ N, which cannot factor topologically onto the Zd Bernoulli shift on N symbols.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multidimensional Sofic Shifts without Separation and Their Factors

For d ≥ 2 we exhibit mixing Z shifts of finite type and sofic shifts with large entropy but poorly separated subsystems (in the sofic examples, the only minimal subsystem is a single point). These examples consequently have very constrained factors; in particular, no non-trivial full shift is a factor. We also provide examples to distinguish certain mixing conditions, and develop the natural cl...

متن کامل

Factoring Higher-Dimensional Shifts Of Finite Type Onto The Full Shift

A one-dimensional shift of finite type (X,Z) with entropy at least logn factors onto the full n-shift. The factor map is constructed by exploiting the fact that X, or a subshift of X, is conjugate to a shift of finite type in which every symbol can be followed by at least n symbols. We will investigate analogous statements for higherdimensional shifts of finite type. We will also show that for ...

متن کامل

Fiber-Mixing Codes between Shifts of Finite Type and Factors of Gibbs Measures

A sliding block code π : X → Y between shift spaces is called fiber-mixing if, for every x and x′ in X with y = π(x) = π(x′), there is z ∈ π−1(y) which is left asymptotic to x and right asymptotic to x′. A fiber-mixing factor code from a shift of finite type is a code of class degree 1 for which each point of Y has exactly one transition class. Given an infinite-to-one factor code between mixin...

متن کامل

Shifts of Finite Type with Nearly Full Entropy

For any fixed alphabet A, the maximum topological entropy of a Z d subshift with alphabet A is obviously log |A|. We study the class of nearest neighbor Z shifts of finite type which have topological entropy very close to this maximum, and show that they have many useful properties. Specifically, we prove that for any d, there exists δd > 0 such that for any nearest neighbor Z d shift of finite...

متن کامل

Projectional Entropy and the Electrical Wire Shift – Preliminary Version

In this paper we present an extendible, block gluing Z shift of finite type W el in which the topological entropy equals the L-projectional entropy for a two-dimensional sublattice L ( Z, even so W el is not a full Z extension of W el L . In particular this example shows that Theorem 4.1 of [3] does not generalize to r-dimensional sublattices L for r > 1. Nevertheless we are able to reprove and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007